Toggle navigation
Home
About
About Journal
Historical Evolution
Indexed In
Awards
Reference Index
Editorial Board
Journal Online
Archive
Project Articles
Most Download Articles
Most Read Articles
Instruction
Contribution Column
Author Guidelines
Template
FAQ
Copyright Agreement
Expenses
Academic Integrity
Contact
Contact Us
Location Map
Subscription
Advertisement
中文
Journals
Publication Years
Keywords
Search within results
(((GONG Dunwei[Author]) AND 1[Journal]) AND year[Order])
AND
OR
NOT
Title
Author
Institution
Keyword
Abstract
PACS
DOI
Please wait a minute...
For Selected:
Download Citations
EndNote
Ris
BibTeX
Toggle Thumbnails
Select
Communication coverage reduction method of parallel programs based on dominant relation
ZHANG Chen, TIAN Tian, YANG Xiuting, GONG Dunwei
Journal of Computer Applications 2021, 41 (
6
): 1741-1747. DOI:
10.11772/j.issn.1001-9081.2020091369
Abstract
(
269
)
PDF
(944KB)(
301
)
Knowledge map
Save
The increase of communication scale and non-deterministic communication make the communication test of Message-Passing Interface (MPI) parallel programs more difficult. In order to solve the problems, a new method of reducing communication coverage based on dominant relation was proposed. Firstly, based on the correspondence between communications and communication statements, the reduction problem of communications was converted into a reduction problem of communication statements. Then, the dominant relation of statements was used to solve the reduction set of communication statement set. Finally, the communications related to the reduction set were selected as the targets to be covered, so that the test data covering these targets covered all the communications. The proposed method was applied to 7 typical programs under test. Experimental results show that, compared with the test data generation method with all communication as coverage targets, the proposed method can reduce the generation time of test data by up to 95% without reducing the coverage rate of communications, indicating that the proposed method can improve the generation efficiency of communication coverage test data.
Reference
|
Related Articles
|
Metrics
Select
Uncertain life strength rescue path planning based on particle swarm optimization
GENG Na, GONG Dunwei, ZHANG Yong
Journal of Computer Applications 2015, 35 (
10
): 2828-2832. DOI:
10.11772/j.issn.1001-9081.2015.10.2828
Abstract
(
456
)
PDF
(728KB)(
366
)
Knowledge map
Save
In order to solve the problem of rescuing the maximum number of trapped men in limited time after disaster, the robots were used to take place of rescue workers to rescue the survivors after disaster, and the robots rescue path planning method was studied by considering the situation that the trapped men's life strengths were uncertain. Firstly, considering that each target has life strength and the values of life strengths were different due to different factors, the value of life strength was set as interval number in general. Secondly, taking life strength constraint into account, the rescued worker number was treated as the objective function, which is an interval function related to life strength. Then the modified Particle Swarm Optimization (PSO) algorithm was used to solve the established objective function, the particle's code and decode method and the global best solution update strategy were introduced. Finally, the effectiveness of the proposed method was verified by simulations of different scenarios.
Reference
|
Related Articles
|
Metrics